Automated Deduction in a Graphical Temporal Logic
نویسندگان
چکیده
Real-Time Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automated deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the logic and produces counterexamples to invalid proofs. The user interface includes a graphical editor that enables the user to create graphical formulas on a workstation display, and a database and proof manager that tracks proof dependencies and allows graphical formulas to be stored and retrieved. In this paper we describe the logic, the automated deduction system, and an application to robotics.
منابع مشابه
Temporal Deduction in a Graphical Logic
Graphical Interval Logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have implemented an automated deduction system for Graphical Interval Logic that includes a graphical user interface and an ...
متن کاملA Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic
We present a natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. The system extends the natural deduction construction of the classical propositional logic. This will open the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various AI applications.
متن کاملNatural Deduction Calculus for Computation Tree Logic CTL
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various applications in AI and Comp...
متن کاملAutomated Deduction of Finite-State Control Programs for Reactive Systems
We propose an approach towards the automatic synthesis of nite-state reactive control programs from purely declarative, logic spec-iications of their requirements. More precisely, if P is a set of proposi-tional temporal logic formulas, representing the environment of a reactive system, and if is a propositional formula, representing a safety requirement , then we point out how to deduce a most...
متن کاملReducing Validity in Epistemic ATL to Validity in Epistemic CTL
We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 6 شماره
صفحات -
تاریخ انتشار 1996